Multicolored Subsets in Colored Hypergraphs
نویسندگان
چکیده
منابع مشابه
Multicolored matchings in hypergraphs
For a collection of (not necessarily distinct) matchingsM = (M1,M2, . . . ,Mq) in a hypergraph, where each matching is of size t, a matching M of size t contained in the union ∪i=1Mi is called a rainbow matching if there is an injective mapping from M to M assigning to each edge e of M a matching Mi ∈M containing e. Let f(r, t) denote the maximum k for which there exists a collection of k match...
متن کاملLarge almost monochromatic subsets in hypergraphs
We show that for all l and ǫ > 0 there is a constant c = c(l, ǫ) > 0 such that every l-coloring of the triples of an N -element set contains a subset S of size c √ logN such that at least 1 − ǫ fraction of the triples of S have the same color. This result is tight up to the constant c and answers an open question of Erdős and Hajnal from 1989 on discrepancy in hypergraphs. For l ≥ 4 colors, it ...
متن کاملApproximations to m-Colored Complete Infinite Hypergraphs
Given an edge colouring of a graph with a set of m colours, we say that the graph is (exactly) m-coloured if each of the colours is used. In 1999, Stacey and Weidl, partially resolving a conjecture of Erickson from 1994, showed that for a fixed natural number m > 2 and for all sufficiently large k, there is a k-colouring of the complete graph on N such that no complete infinite subgraph is exac...
متن کاملLong Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs
Here we prove that for n ≥ 140, in every 3-coloring of the edges of K (4) n there is a monochromatic Berge cycle of length at least n− 10. This result sharpens an asymptotic result obtained earlier. Another result is that for n ≥ 15, in every 2-coloring of the edges of K n there is a 3-tight Berge cycle of length at least n− 10.
متن کاملMonochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
We conjecture that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Bergecycle in every (r − 1)-coloring of the edges of K n , the complete r-uniform hypergraph on n vertices. We prove the conjecture for r = 3, n 5 and its asymptotic version for r = 4. For general r we prove weaker forms of the conjecture: there is a Hamiltonian Berge-cycle in (r−1)/2 -colorings of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1996
ISSN: 0097-3165
DOI: 10.1006/jcta.1996.0049